Alice and Bob in Love: Cryptographic Communication Using Natural Entropy
نویسنده
چکیده
We propose a protocol for secure communication between two parties who know each other well using only the entropy from their shared life experience. This could enable, for example, lovers or close friends to communicate over a one-way channel without prior key exchange. Our system uses a flexible secret-sharing mechanism to accommodate pieces of personal knowledge of variable entropy and memorability, while still providing reasonable overhead and a high security level.
منابع مشابه
Alice and Bob in Love: Cryptographic Communication Using Natural Entropy (draft version)
We propose a protocol for secure communication between two parties who know each other well using only the entropy from their shared life experience. This could enable, for example, lovers or close friends to communicate over a one-way channel without prior key exchange. Our system uses a flexible secret-sharing mechanism to accommodate pieces of personal knowledge of variable entropy and memor...
متن کاملComp760, Summary of Lecture 14
So far, in this course, we have been focused on the communication cost of protocols, and given various communication tasks, we studied the minimum communication cost required to perform those tasks. The information theoretic tools introduced in the past two lectures enable us to introduce another natural measure of complexity. Roughly speaking, given a protocol and a distribution on the inputs ...
متن کاملTowards a theory of variable privacy
We define “variable privacy” as the use of non-perfect protocols with parameters controlled by Alice. Variable privacy enables Alice to choose the amount of information leaked to Bob, in situations where information revelation bears a privacy cost and also provides a benefit. We propose a framework for the study of variable privacy, using a security perspective to obtain a privacy measure of th...
متن کامل2 00 6 Quantum mutual information and the one - time pad
A one-time pad [1] is a cryptographic protocol in which communicators Alice and Bob initially have correlated random variables, collectively called the “key”, that are not correlated with any variables possessed by a potential eavesdropper Eve. (In most discussions, the key variables possessed by Alice and Bob are supposed to be perfectly correlated—e.g., they are identical copies of the same s...
متن کاملGeneralized Upper Bound of Agreement Probability for Extracting Common Random Bits From Correlated Sources
Suppose that both Alice and Bob receive independent random bits without any bias, which are influenced by an independent noise. From the received random bits, Alice and Bob are willing to extract common randomness, without any communication. The extracted common randomness can be used for authentication or secrets. Recently, Bogdanov and Mossel derived an upper bound of the agreement probabilit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009